Polynomial Convergence of Primal-Dual Algorithms for SDLCP Based on the M-Z Family of Directions
نویسنده
چکیده
This paper establishes the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the shortstep path-following algorithm of Kojima et al., carry over to the context of SDLCP. Mathematics Subject Classification: 90C33, 65G20, 65G50
منابع مشابه
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
Kojima, Shindoh and Hara proposed a family of search directions for the semidefinite linear complementarity problem (SDLCP) and established polynomial convergence of a feasible short-step pathfollowing algorithm based on a particular direction of their family. The question of whether polynomiality could be established for any direction of their family thus remained an open problem. This paper a...
متن کاملA Predictor-Corrector Algorithms with Polynomial Convergence for SDLCP Based on the M-Z Family of Directions
We establishes the polynomial convergence of a new class of pathfollowing methods for semidefinite linear complementarity problems, whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carr...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملPolynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
In this paper we study primal-dual path-following algorithms for the second-order cone programming (SOCP) based on a family of directions that is a natural extension of the Monteiro-Zhang (MZ) family for semidefinite programming. We show that the polynomial iteration-complexity bounds of two well-known algorithms for linear programming, namely the short-step path-following algorithm of Kojima e...
متن کاملPrimal-Dual Path-Following Algorithms for Semidefinite Programming
This paper deals with a class of primal-dual interior-point algorithms for semideenite programming (SDP) which was recently introduced by Kojima, Shindoh and Hara 11]. These authors proposed a family of primal-dual search directions that generalizes the one used in algorithms for linear programming based on the scaling matrix X 1=2 S ?1=2. They study three primal-dual algorithms based on this f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011